Eternal m-security bondage numbers in graphs
نویسندگان
چکیده
منابع مشابه
Eternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملMobile Eternal Security in Graphs
We consider the problem of securing a graph against a sequence of vertex attacks by placing guards on its vertices. The guards are “mobile” in that, after any attack, each guard can move to any neighbor of its current location, but one guard must move to the attacked vertex. We determine sharp upper bounds, in terms of the order of the graph, on the minimum number of guards necessary for connec...
متن کاملRoman bondage numbers of some graphs
A Roman dominating function on a graph G = (V,E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u with f(u) = 0 is adjacent to at least one vertex v with f(v) = 2. The weight of a Roman dominating function is the value f(G) = ∑ u∈V f(u). The Roman domination number of G is the minimum weight of a Roman dominating function on G. The Roman bondage number of a nonempty ...
متن کاملThe bondage numbers of graphs with small crossing numbers
The bondage number b(G) of a nonempty graph G is the cardinality of a smallest edge set whose removal from G results in a graph with domination number greater than the domination number (G) ofG. Kang andYuan proved b(G) 8 for every connected planar graph G. Fischermann, Rautenbach and Volkmann obtained some further results for connected planar graphs. In this paper, we generalize their results ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2018
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2054